A Bayesian definition of ‘most probable’ parameters

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Most Probable Bayesian Network and Beyond

This doctoral dissertation introduces an algorithm for constructing the most probable Bayesian network from data for small domains. The algorithm is used to show that a popular goodness criterion for the Bayesian networks has a severe sensitivity problem. The dissertation then proposes an information theoretic criterion that avoids the problem. Computing Reviews (1998)

متن کامل

Structure Approximation of Most Probable Explanations in Bayesian Networks

Abstract Typically, when one discusses approximation algorithms for (NP-hard) problems (like TRAVELING SALESPERSON, VERTEX COVER, KNAPSACK), one refers to algorithms that return a solution whose value is (at least ideally) close to optimal; e.g., a tour with almost minimal length, a vertex cover of size just above minimal, or collection of objects that has close to maximal value. In contrast, o...

متن کامل

Study of the Most Probable Explanation in Hybrid Bayesian Networks

In addition to computing the posterior distributions for hidden variables in Bayesian networks, one other important inference task is to find the most probable explanation (MPE). MPE provides the most likely configurations to explain away the evidence and helps to manage hypotheses for decision making. In recent years, researchers have proposed a few methods to find the MPE for discrete Bayesia...

متن کامل

Tractability of most probable explanations in multidimensional Bayesian network classifiers

Multidimensional Bayesian network classifiers have gained popularity over the last few years due to their expressive power and their intuitive graphical representation. A drawback of this approach is that their use to perform multidimensional classification, a generalization of multi-label classification, can be very computationally demanding when there are a large number of class variables. Th...

متن کامل

Most probable explanations in Bayesian networks: Complexity and tractability

An overview is given of definitions and complexity results of a number of variants of the problem of probabilistic inference of the most probable explanation of a set of hypotheses given observed phenomena.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Geotechnical Research

سال: 2018

ISSN: 2052-6156

DOI: 10.1680/jgere.18.00027